#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template <class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define FOR2(i, a, b, c) for (auto i = (a); i <= (b); i += c)
#define FORD(i, b, a) for (auto i = (a); i >= (b); i--)
#define FORD2(i, b, a, c) for (auto i = (a); i >= (b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define fi first
#define se second

void solve() {
    int n, m;
    cin >> n >> m;

    V<int> w(n + 1, 0);

    FOR(i, 1, n) cin >> w[i];

    V<V<int>> f(n + 2, V<int>(m + 1, 1e18));
    f[0][0] = 0;
    FOR(i, 1, n) {
        FOR(j, 0, m) {
            FOR(k, 0, j) {
                if (i - k >= 1) {
                    int mn = 1e18;
                    FOR(t, i - k, i) { mn = min(mn, w[t]); }
                    f[i][j] = min({f[i][j], f[i - 1][j] + w[i], f[i - k - 1][j - k] + (k + 1) * mn});
                } else {
                    f[i][j] = min(f[i][j], f[i - 1][j] + w[i]);
                }
            }
        }
    }

    int ans = 1e18;
    FOR(i, 0, m) ans = min(ans, f[n][i]);
    cout << ans << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
